Model Checking LTL with Fairness Assumptions using Net Unfoldings
نویسنده
چکیده
We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in [1] the authors have proposed a new technique for LTL model checking that exploits the partial order semantics of these net unfoldings. We propose a technique for incorporating fairness assumptions as part of the model while checking LTL properties. Fairness assumptions are often necessary for faithfully modeling a distributed computation. Our method extends the model checking algorithm presented by the authors in [1] and draws machinery from petri net theory and automata theory. Our method has the advantage that it is linear in the number of fairness assumptions and the size of the unfolding developed. Thus, it is practical to check large structures with underlying fairness assumptions.
منابع مشابه
Predictability Verification with Parallel LTL-X Model Checking Based on Petri Net Unfoldings
We show that the predictability problem for a Petri net can be reduced to LTL-X model checking. The advantage of this is that existing efficient methods and tools can be employed, in particular parallel model checking based on Petri net unfoldings. The experimental results show that this approach is efficient, and a good level of parallelisation can be achieved. © 2011 Newcastle University. Pri...
متن کاملCombining symbolic and partial order methods for model checking 1-safe Petri nets
In this work, methods are presented for model checking finite state asynchronous systems, more specifically 1-safe Petri nets, with the aim of alleviating the state explosion problem. Symbolic model checking techniques are used, combined with two partial order semantics known as net unfoldings and processes. We start with net unfoldings and study deadlock and reachability checking problems, usi...
متن کاملModel Checking with Net Unfoldings ?
We report on an implementation of the unfolding approach to model-checking LTL-X presented in [3]. Contrary to [3], we consider an state-based version of LTL-X, which is more used in practice. We improve on the checking algorithm; the new version allows to reuse code much more e ciently. We present results on a set of case studies.
متن کاملParallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings
We present an unfolding-based approach to LTL-X modelchecking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, 5] and a state of the art parallel high-level net unfolder described in [15, 13]. We present experimental results comparing our approach to the one of [4, 5] and the model-checker
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004